Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
نویسندگان
چکیده
منابع مشابه
Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
In this paper, we present sharp bounds for the Zagreb indices, Harary index and hyperWiener index of graphs with a given matching number, and we also completely determine the extremal graphs. © 2010 Elsevier Ltd. All rights reserved.
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملSharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we investigate Zagreb indices of bicyclic graphs with a given matching number. Sharp upper bounds for the first and second Zagreb indices of bicyclic graphs in terms of the...
متن کاملThe hyper-Wiener index of unicyclic graphs with given matching number
We determine the minimum hyper-Wiener index of unicyclic graphs with given number of vertices and matching number, and characterize the extremal graphs. Mathematics Subject Classification (2010): 05C12, 05C35, 05C90.
متن کاملMinimum Wiener Indices of Trees and Unicyclic Graphs of given Matching Number
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. We determine the minimum Wiener indices of trees and unicyclic graphs with given number of vertices and matching number, respectively. The extremal graphs are characterized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2010
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.04.017